A Fault-Tolerant Algorithm of Wireless Sensor Network Based on Recoverable Nodes
نویسندگان
چکیده
In wireless sensor networks, the node faults often occurred in scenes because of severe disturbance, harsh environment and inherent weakness of the networks. In this paper, a fault tolerance directed diffusion protocol, termed fault-tolerant algorithm with recoverable nodes (FTA-RN), is proposed to extend the lifetime of the wireless sensor network based on recoverable host nodes, in which a heartbeat detection algorithm is applied to detect node failure. In FTA-RN, each recoverable intermediate node has a redundant node for fault tolerant function to increase the rate of successful data reception. The nodes are designed based on a kind of recoverable model to prevent the disadvantage of nodes instantaneous fault. Moreover, the energy of host nodes can be used efficiently in recovering model. The simulation result shows that more messages can be received on the sink node using FTA-RN compared with the traditional DD protocol in tolerable amount of delay time and energy consumption, and the lifetime of wireless sensor network in FTA-RN are remarkable longer than traditional DD protocol because of the effect of backup nodes and recoverable host nodes.
منابع مشابه
FDMG: Fault detection method by using genetic algorithm in clustered wireless sensor networks
Wireless sensor networks (WSNs) consist of a large number of sensor nodes which are capable of sensing different environmental phenomena and sending the collected data to the base station or Sink. Since sensor nodes are made of cheap components and are deployed in remote and uncontrolled environments, they are prone to failure; thus, maintaining a network with its proper functions even when und...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملRAWSN: A Routing Algorithm Based on Auxiliary Nodes to Reduce Energy Consumption in Wireless Sensor Networks
In this paper, an algorithm , based on genetics and auxiliary nodes, to reduce energy consumption in wireless sensor networks has been presented. In this research, by considering some parameters as energy and distance, a target function has been created, which is more optimum comparing to other methods. In this research cluster head is selected by genetic algorithm. In RAWSN algorithm a new tec...
متن کامل3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملA multi-hop PSO based localization algorithm for wireless sensor networks
A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Intelligent Automation & Soft Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2011